Refine your search
Co-Authors
Journals
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sharma, Birendra Kumar
- A Modified Variant of RSA Algorithm for Gaussian Integers
Abstract Views :336 |
PDF Views:0
Authors
Affiliations
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, IN
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, IN
Source
Research Journal of Science and Technology, Vol 5, No 3 (2013), Pagination: 300-302Abstract
A Gaussian prime is a Gaussian integer that cannot be expressed in the form of the product of other Gaussian integers. The concept of Gaussian integer was introduced by Gauss who proved its unique factorization domain. In this paper, we propose a modified RSA variant using the domain of Gaussian integers providing more security as compare to the old one.Keywords
RSA Public-Key Cryptosystem, Gaussian Integers RSA, Multiprime.
- New Identity based Key Exposure Free Chameleon Hashing Based on the RSA Assumption
Abstract Views :158 |
PDF Views:0
Authors
Affiliations
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur, (C.G.), IN
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur, (C.G.), IN
Source
Research Journal of Science and Technology, Vol 5, No 3 (2013), Pagination: 307-312Abstract
In this paper, we improve the security of an id based key exposure free chameleon hashing scheme based on RSA assumption for this purpose we have contribute two random integer to compute chameleon hashing by doing so, prevent some signature from collision resistant active attack and also make it security scheme.Keywords
Signature, Chameleon Hashing, Key Exposure, Gap Diffiehellman Group, RSA Assumption.- ID-Based Signature Scheme with Weil Pairing
Abstract Views :195 |
PDF Views:3
Authors
Affiliations
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
Source
International Journal of Advanced Networking and Applications, Vol 5, No 2 (2013), Pagination: 1893-1897Abstract
Digital signature is an essential component in cryptography. Digital signaturesguarantee end-to-end message integrity and authentication information about the origin of a message. In this paper we propose a new identification based digital signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Security of our scheme is based on expressing the torsion point of curve into linear combination of its basis points; it is more complicated than solving ECDLP(Elliptic Curve Discrete Logarithm Problem). We claim that our new identification based digital signature scheme is more secure and efficient than the existing scheme of Islam et al(S. K. Hafizul Islam, G.P. Biswas, An Efficient and Provably-secure Digital signature Scheme based on Elliptic Curve Bilinear Pairings, Theoretical and Applied Informatics ISSN 18965334 Vol.24, no. 2, 2012, pp. 109-118) based on bilinear pairing.Keywords
Cryptography, Digital Signature Scheme, Identification Scheme, Elliptic Curve Cryptosystem, Chosen Message Attack.Full Text